Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic
نویسندگان
چکیده
This paper addresses the problem of generating deterministic ω-automata for formulas of linear temporal logic, which can be solved by applying wellknown algorithms to construct a nondeterministic Büchi automaton for the given formula on which we then apply a determinization algorithm. We study here in detail Safra’s determinization algorithm, present several heuristics that attempt to decrease the size of the resulting automata and report on experimental results.
منابع مشابه
Backward deterministic and weak alternating $\omega$-automata
We present a direct transformation of weak alternating ω-automata into equivalent backward deterministic ω-automata and show (1) how it can be used to obtain a transformation of non-deterministic Büchi automata into equivalent backward deterministic automata and (2) that it yields optimal equivalent backward deterministic automata when applied to linear-time temporal logic formulas. (1) uses th...
متن کاملGenerating Deterministic ω-Automata for most LTL Formulas by the Breakpoint Construction
Temporal logics like LTL are frequently used for the specification and verification of reactive systems. To this end, LTL formulas are typically translated to nondeterministic Büchi automata so that the LTL verification problem is reduced to a nonemptiness problem of ω-automata. While nondeterministic automata are sufficient for this purpose, many other applications require deterministic ω-auto...
متن کاملLTL to Deterministic Emerson-Lei Automata
We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are ω-automata with a Muller acceptance condition symbolically expressed as a Boolean formula. The richer acceptance condition structure allows the shift of complexity from the state space to the acceptance condition. Conceptually the construction is an enhanced product construction that...
متن کاملAre Good-for-Games Automata Good for Probabilistic Model Checking?
The potential double exponential blow-up for the generation of deterministic ω-automata for linear temporal logic formulas motivates research on weaker forms of determinism. One of these notions is the goodfor-games property that has been introduced by Henzinger and Piterman together with an algorithm for generating good-for-games automata from nondeterministic Büchi automata. The contribution ...
متن کاملParametric Linear Dynamic Logic
We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL) that is able to express all ω-regular specifications while still maintaining many of LTL’s desirable properties like an intuitive syntax and a translation into non-dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005